An Improved Multi-Priority Preemptive Scheduler for Transputer-Based Real-Time Systems
نویسندگان
چکیده
Real-time applications require an eficient scheduler supporting multiple priority levels and fast preemption. In this paper, we propose a scheduler based on the hardware-supported scheduler of transputers, Though the hardware-supported scheduler of transputers is very eficient in terms of scheduling overhead, it should be extended to support multiple priority levels and fast preemption in order to be used in real-time applications. Many schedulers have been proposed. However, they have several drawbacks in terms of scheduling overhead, preemption latency, and portability. I n reference [3], we have proposed a scheduler featuring low Scheduling overhead and portability while suflering from a long preemption delay. In this paper, we propose an improved scheduler which greatly reduces preemption delay by using ISL (Interrupt Save Location) an transputers. Experimental results show that the improved scheduler overhead is about 13.54psec and its preemption delay is well below 42psec.
منابع مشابه
A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملExploiting Precedence Relations in the Schedulability Analysis of Distributed Real-Time Systems
In this paper we present improved techniques for the schedulability analysis of tasks with precedence relations in multiprocessor and distributed systems, scheduled under a preemptive fixed priority scheduler. Recently developed techniques, based on the analysis of tasks with dynamic offsets, take into account the precedence relations between tasks only indirectly, through terms iteratively est...
متن کاملLimited - preemptive fixed priority scheduling of real - time tasks on multiprocessors
Acknowledgement I would like to express my sincere acknowledgements to the Mälardalen University and East China University of Science and Technology for the precious chance they have provided to realize and complete my one year study here with my total satisfaction. Special appreciation goes to Dr. Radu Dobrin, Dr. Moris Behnam, Abhilash Thekkilakattil for giving me all the support that I neede...
متن کاملReducing Execution Waste in Priority Scheduling: a Hybrid Approach
Guaranteeing quality for differentiated services while ensuring resource efficiency is an important and yet challenging problem in large computing clusters. Priority scheduling is commonly adopted in production systems to minimize the response time of high-priority workload by means of preempting the execution of low-priority workload when faced with limited resources. As a result, the system p...
متن کاملAn Empirical Investigation of Eager and Lazy Preemption Approaches in Global Limited Preemptive Scheduling
Global limited preemptive real-time scheduling in multiprocessor systems using Fixed Preemption Points (FPP) brings in an additional challenge with respect to the choice of the task to be preempted in order to maximize schedulability. Two principal choices with respect to the preemption approach exist 1) the scheduler waits for the lowest priority job to become preemptible, 2) the scheduler pre...
متن کامل